Stability analysis of time-varying delay neural network for convex quadratic programming with equality constraints and inequality constraints

نویسندگان

چکیده

<p style='text-indent:20px;'>This paper presented a class of neural networks with time-varying delays to solve quadratic programming problems. Compared previous papers, the proposed in this replaced constant time <inline-formula><tex-math id="M1">\begin{document}$ \tau $\end{document}</tex-math></inline-formula> variable id="M2">\begin{document}$ \tau(t) and had more concise structure. There was an improvement method proving existence uniqueness solutions paper. Further, gave conditions be satisfied for global exponential stability networks. Through numerical examples, verified that were accurate efficient solving problems.</p>

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A dual neural network for convex quadratic programming subject to linear equality and inequality constraints

A recurrent neural network called the dual neural network is proposed in this Letter for solving the strictly convex quadratic programming problems. Compared to other recurrent neural networks, the proposed dual network with fewer neurons can solve quadratic programming problems subject to equality, inequality, and bound constraints. The dual neural network is shown to be globally exponentially...

متن کامل

An Analytic Solution for Some Separable Convex Quadratic Programming Problems with Equality and Inequality Constraints

In this paper we provide a complete analytic solution to a particular separable convex quadratic programming problem with bound and equality constraints. This study constitutes the generalization of prior papers in which additional simplifications were considered. We present an algorithm that leads to determination of the analytic optimal solution. We demonstrate that our algorithm is able to d...

متن کامل

Fully fuzzy linear programming with inequality constraints

Fuzzy linear programming problem occur in many elds such as mathematical modeling, Control theory and Management sciences, etc. In this paper we focus on a kind of Linear Programming with fuzzy numbers and variables namely Fully Fuzzy Linear Programming (FFLP) problem, in which the constraints are in inequality forms. Then a new method is proposed to ne the fuzzy solution for solving (FFLP). Nu...

متن کامل

A Recurrent Neural Network for Solving Complex-Valued Quadratic Programming Problems with Equality Constraints

A recurrent neural network is presented for solving systems of quadratic programming problems with equality constraints involving complex-valued coefficients. The proposed recurrent neural network is asymptotically stable and able to generate optimal solutions to quadratic programs with equality constraints. An opamp based analogue circuit realization of the recurrent neural network is describe...

متن کامل

Equality Constraints in FeasibleSequential Quadratic Programming

A simple scheme is proposed for handling nonlinear equality constraints in the context of a previously introduced sequential quadratic programming (SQP) algorithm for inequality constrained problems, generating iterates satisfying the constraints. The key is an idea due to Mayne and Polak (Math. Progr., vol. 11, pp. 67{80, 1976) by which nonlinear equality constraints are treated as \"-type con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete and Continuous Dynamical Systems-series B

سال: 2022

ISSN: ['1531-3492', '1553-524X']

DOI: https://doi.org/10.3934/dcdsb.2022035